Embedding lattices in the Kleene degrees

نویسنده

  • H. Muraki
چکیده

Under ZFC+CH, we prove that some lattices whose cardinalities do not exceed א1 can be embedded in some local structures of Kleene degrees. 0. We denote by 2E the existential integer quantifier and by χA the characteristic function of A, i.e. x ∈ A⇔ χA(x) = 1, and x 6∈ A⇔ χA(x) = 0. Kleene reducibility is defined as follows: for A,B ⊆ ω, A ≤K B iff there is a ∈ ω such that χA is recursive in a, χB , and 2E. We introduce the following notations. K denotes the upper semilattice of all Kleene degrees with the order induced by ≤K. For X,Y ⊆ ω, we set X ⊕ Y = {〈0〉 ∗ x | x ∈ X} ∪ {〈1〉 ∗ x | x ∈ Y }. Then deg(X ⊕ Y ) is the supremum of deg(X) and deg(Y ). The superjump of X is the set XSJ = {〈e〉 ∗x ∈ ω | {e}((x)0, (x)1, χX , 2E)↓}. Here, 〈e〉 ∗x is the real such that (〈e〉 ∗ x)(0) = e and (〈e〉 ∗ x)(n+ 1) = x(n) for n ∈ ω. More generally, for m ∈ ω, 〈e0, . . . , em〉 ∗ x is the real such that (〈e0, . . . , em〉 ∗ x)(n) = en for n ≤ m and (〈e0, . . . , em〉 ∗ x)(n + m + 1) = x(n) for n ∈ ω. Further, (x)0 = λn.x(2n) and (x)1 = λn.x(2n + 1). We identify 〈(x)0, (x)1〉 with x. An X-admissible set is closed under λx.ω 1 iff it is X SJ-admissible. The following conditions (1) and (2) are equivalent to A ≤K B ([8]). (1) There is y ∈ ω such that A is uniformly ∆1-definable over all (B; y)admissible sets; i.e. there are Σ1(Ḃ) formulas φ0 and φ1 such that for any (B; y)-admissible set M and for all x ∈ ω ∩M , x ∈ A⇔M |= φ0(x, y)⇔M |= ¬φ1(x, y). (2) There are y ∈ ω and Σ1(Ḃ) formulas φ0 and φ1 such that for all x ∈ ω, x ∈ A⇔ LωB;x,y 1 [B;x, y] |= φ0(x, y)⇔ LωB;x,y 1 [B;x, y] |= ¬φ1(x, y). 1991 Mathematics Subject Classification: 03D30, 03D65.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

*-Continuous Kleene $\omega$-Algebras for Energy Problems

Energy problems are important in the formal analysis of embedded or autonomous systems. Using recent results on ∗-continuous Kleene ω-algebras, we show here that energy problems can be solved by algebraic manipulations on the transition matrix of energy automata. To this end, we prove general results about certain classes of finitely additive functions on complete lattices which should be of a ...

متن کامل

Peter Jipsen From Semirings to Residuated Kleene Lattices

We consider various classes of algebras obtained by expanding idempotent semirings with meet, residuals and Kleene-∗. An investigation of congruence properties (epermutability, e-regularity, congruence distributivity) is followed by a section on algebraic Gentzen systems for proving inequalities in idempotent semirings, in residuated lattices, and in (residuated) Kleene lattices (with cut). Fin...

متن کامل

An Overview of Residuated Kleene Algebras and Lattices

1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system for Residuated Kleene Lattices and some reducts 4. Interpreting Kleene algebras with tests 1. Residuated Lattices with iteration This talk is mostly about Residuated Kleene Lattices, which are defined as noncommutative residuated 0,1-lattices expanded with a unary operation * that satisfies x ...

متن کامل

On the algebraic structure of Weihrauch degrees

We introduce two new operations (compositional products and implication) on Weihrauch degrees, and investigate the overall algebraic structure. The validity of the various distributivity laws is studied and forms the basis for a comparison with similar structures such as residuated lattices and concurrent Kleene algebras. Introducing the notion of an ideal with respect to the compositional prod...

متن کامل

Infinitary Action Logic: Complexity, Models and Grammars

Action logic of Pratt [21] can be presented as Full Lambek Calculus FL [14, 17] enriched with Kleene star *; it is equivalent to the equational theory of residuated Kleene algebras (lattices). Some results on axiom systems, complexity and models of this logic were obtained in [4, 3, 18]. Here we prove a stronger form of *-elimination for the logic of *-continuous action lattices and the Π1−comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007